Decidability Results for the Boundedness Problem
نویسندگان
چکیده
منابع مشابه
Decidability Results for the Boundedness Problem
We prove decidability of the boundedness problem for monadic least fixed-point recursion based on positive monadic second-order (MSO) formulae over trees. Given an MSO-formula φ(X,x) that is positive in X, it is decidable whether the fixed-point recursion based on φ is spurious over the class of all trees in the sense that there is some uniform finite bound for the number of iterations φ takes ...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولOn decidability of boundedness property for regular path queries
The paper studies the evaluation of regular path queries on semi-structured data, i.e. path queries of the form nd all objects reachable by path whose labels form a word in p where p is a regular expression. We use local information expressed in the form of path inclusions in the optimization of path queries. These constraints are of the form L v where L is a regular language and v is a word; L...
متن کاملDecidability Results for Choreography Realization
A service choreography defines a set of permitted sequences of message events as a specification for the interaction of services. Realizability is a fundamental sanity check for choreographies comparable to the notion of soundness for workflows. We study several notions of realizability: partial, distributed, and complete realizability. They establish increasingly strict conditions on realizing...
متن کاملA New Combination Procedure for the Word Problem That Generalizes Fusion Decidability Results in Modal Logics
Previous results for combining decision procedures for the word problem in the non-disjoint case do not apply to equational theories induced by modal logics—which are not disjoint for sharing the theory of Boolean algebras. Conversely, decidability results for the fusion of modal logics are strongly tailored towards the special theories at hand, and thus do not generalize to other types of equa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2014
ISSN: 1860-5974
DOI: 10.2168/lmcs-10(3:2)2014